User-interfaces for Hybrid Systems: Analysis and Design through Hybrid Reachability

نویسندگان

  • Mitsuko Karen Oishi
  • Claire J. Tomlin
چکیده

Hybrid systems combine discrete state dynamics, which model the dynamics of mode switching in the system, with continuous state dynamics, which model the physical processes themselves. Human interaction with hybrid systems involves the user, the automation’s discrete mode-logic, and the underlying continuous dynamics of the physical system. Often the user-interface of such systems displays a reduced set of information about the entire system. In safety-critical systems, we wish to identify user-interface designs which do not have adequate information, or which may confuse the user. We present 1) a method of designing a discrete event system abstraction of the hybrid system, in order to analyze, verify, or design user-interfaces for hybrid human-automation systems, and 2) the relationship between user-interfaces and discrete observability properties. Applications of hybrid system theory to automated systems have traditionally assumed that the controller itself is an automaton which runs in parallel with the system under control. We model human interaction with a hybrid system, incorporating the user’s input, the automation’s discrete mode-logic, and the physical system’s nonlinear continuous dynamics. Using a hybrid computational tool for reachability, we find the largest region in which we can guarantee the system can always remain – this is the safe region of operation. By implementing a controller for safety which arises from this computation, we mathematically guarantee that this safe region is invariant. This guarantee holds to the accuracy of the model. Using the computed invariant regions as discrete states, we can abstract a discrete event system from this hybrid system with safety restrictions. This abstraction can be used in existing interface analyses, including existing interface verification and design methods. A user-interface, modeled as a discrete system, must not only be reduced (extraneous information has been eliminated), but also “immediately observable”. We derive conditions for immediate observability, in which the current state can be constructed from the current output and last occurring event. We also show how to synthesize an output for remote

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton

Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...

متن کامل

Comparative evaluation and improvement of computational approaches to reachability analysis of linear hybrid systems

This thesis addresses the problem of reachability analysis with the focus on linear hybrid systems. Hybrid systems are a mixture of continuous and discrete behaviors. The Hybrid automaton consisting of a graph, in which the locations describe the continuous and the transitions the discrete behavior, represents the best formal model for such kind of systems. It provides a formalism integrating d...

متن کامل

Model Checking Hybrid Systems

We present the framework of delta-complete analysis for bounded reachability problems of hybrid systems. We perform bounded reachability checking through solving delta-decision problems over the reals. The techniques take into account of robustness properties of the systems under numerical perturbations. Our implementation of the techniques scales well on several highly nonlinear hybrid system ...

متن کامل

Reachability computation for hybrid systems with Ariadne

Ariadne is an in-progress open environment to design algorithms for computing with hybrid automata, that relies on a rigorous computable analysis theory to represent geometric objects, in order to achieve provable approximation bounds along the computations. In this paper we discuss the problem of reachability analysis of hybrid automata to decide safety properties. We describe in details the a...

متن کامل

δ-Complete Analysis for Bounded Reachability of Hybrid Systems

We present the framework of δ-complete analysis for bounded reachability problems of general hybrid systems. We perform bounded reachability checking through solving δ-decision problems over the reals. The techniques take into account of robustness properties of the systems under numerical perturbations. We prove that the verification problems become much more mathematically tractable in this n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003